Cosets and genericity
نویسنده
چکیده
In a connected group of finite Morley rank in which the generic element belongs to a connected nilpotent subgroup, proper normalizing cosets of definable subgroups are not generous. We explain why this is true and what consequences this has on an abstract theory of Weyl groups in groups of finite Morley rank. The only known infinite simple groups of finite Morley rank are the simple algebraic groups over algebraically closed fields and this is a motivation, among many others, for a classification project of these groups. It borrows ideas and technics from the Classification of the Finite Simple Groups but at the same time, and it is a highly nontrivial task, it provides a kind of simplified version of the finite case. This is mostly due to the existence of well-behaved notions of genericity and connectivity in the infinite case which unfortunately can hardly find finite analogs. The present short technical note deals with a very specific topic concerning such arguments based on genericity in the case of infinite groups of finite Morley rank, showing at least similarities with algebraic groups in any case as far as a theory of Weyl groups is concerned. This applies also to certain non-algebraic configurations of groups of finite Morley rank, which may not be entirely unexpected. In a simple algebraic group, maximal (algebraic) tori are conjugate and cover the group generically, with the Weyl group governing essentially the structure of the entire group. There are at least two abstract versions of tori in groups of finite Morley rank and which coincide at least in the case of a simple algebraic group, decent tori on the one hand and Carter subgroups on the other. The main caveat with these two more abstract notions is in both cases an unknown existence, more precisely the existence of a nontrivial decent torus on the one hand and the existence of a generous Carter subgroup on the other. In general “generous” for a subset of a group means “whose union of conjugates is generic in the group”, the typical property of tori in algebraic groups. With both notions there are conjugacy theorems in case of existence, or more precisely there are conjugacy theorems with nontrivial contents in case of existence. This gives a natural notion of Weyl group in each case, N(T )/C(T ) for some maximal decent torus T or N(Q)/Q for some generous Carter subgroup Q. In any case and whatever the Weyl group is, it is finite and, as with classical Weyl groups
منابع مشابه
Incidence Properties of Cosets in Loops
We study incidence properties among cosets of finite loops, with emphasis on well-structured varieties such as antiautomorphic loops and Bol loops. While cosets in groups are either disjoint or identical, we find that the incidence structure in general loops can be much richer. Every symmetric design, for example, can be realized as a canonical collection of cosets of a finite loop. We show tha...
متن کاملSOME QUOTIENTS ON A BCK-ALGEBRA GENERATED BY A FUZZY SET
First we show that the cosets of a fuzzy ideal μ in a BCK-algebraX form another BCK-algebra X/μ (called the fuzzy quotient BCK-algebra of X by μ). Also we show thatX/μ is a fuzzy partition of X and we prove several some isomorphism theorems. Moreover we prove that if the associated fuzzy similarity relation of a fuzzy partition P of a commutative BCK-algebra iscompatible, then P is a fuzzy quo...
متن کاملOn Coset Weight Distributions of the 3-Error-Correcting BCH-Codes
We study the coset weight distributions of the 3-error-correcting binary narrowsense BCH-codes and of their extensions, whose lengths are, respectively, 2m − 1 and 2m, m odd. We prove that all weight distributions are known as soon as those of the cosets of minimum weight 4 of the extended code are known. We point out that properties of the cosets which are orphans yield interesting properties ...
متن کاملIncreasing Software Reliability through Use of Genericity
In our opinion, methods for construction of reliable software are of great importance. Reliability engineering must start in the earliest phases of a software project, and it has to consider not only the architectural level, but should be in the mind of humans even earlier when analyzing the problem space. In a previous paper, we argued that reduction of redundancy of software is a central fact...
متن کاملHana Filip and Greg
There are various opinions about how the phenomenon of sentential genericity (Carlson and Pelletier, 1995) is related to other classes of expressions of natural language. The notion of 'genericity' is most commonly viewed as having close ties to tense, mood and aspect (cf. Dahl, 1985; Comrie, 1985). For instance, philosophers and occasionally linguists (e.g. Dahl, 1975, 1985, and 1995) make use...
متن کامل